Towards Strategic Kriegspiel Play with Opponent Modeling
نویسندگان
چکیده
Kriesgpiel, or partially observable chess, is appealing to the AI community due to its similarity to real-world applications in which a decision maker is not a lone agent changing the environment. This paper applies the framework of Interactive POMDPs to design a competent Kriegspiel player. The novel element, compared to the existing approaches, is to model the opponent as a competent player and to predict his likely moves. The moves of our own player can then be computed based on these predictions. The problem is challenging because, first, there are many possible world states the agent has to keep track of. Second, one may be unsure about the characteristics of the other player which could influence his behavior, such as his level of expertise or his evaluation function. To keep the size of the state space manageable we consider a scaled down version of Kriegspiel played on 4 by 4 chessboard with only a king and a queen on both sides. To deal with an opponent with uncertain characteristics we use the notion of quantal responses developed in behavioral game theory. This allows us to consider only one prototypical opponent while modeling a whole ensamble of possible opponents. We implemented our approach using influence diagrams, and discuss results in example situations.
منابع مشابه
The Dark Side of the Chessboard: an Assistant to Play Kriegspiel over the ICC
Kriegspiel is a variant of the game of Chess, introduced to make it more similar to wargames. It mainly differs from Chess in that players can only see their own pieces: they have to refer to a neutral agent – the umpire, or referee – to acquire additional, but always incomplete, information. This paper deals with the development of a visual interface to play Kriegspiel over the Internet Chess ...
متن کاملParticle Filtering Approximation of Kriegspiel Play with Opponent Modeling
Kriesgpiel, or partially observable chess, is appealing to the AI community due to its similarity to real-world applications in which a decision maker is not a lone agent changing the environment. This paper applies the framework of interactive POMDPs to design a competent Kriegspiel player. The novel element proposed here is a way to handle complexity in I-POMDPs by using the notion of quantal...
متن کاملMoving in the Dark: Progress through Uncertainty in Kriegspiel
Kriegspiel is a wargame based on the rules of Chess. A player only knows the position of his own pieces, while his opponent’s pieces are “in the dark”, ie. they are invisible. A Kriegspiel player has to guess the state of the game and progress to checkmate being in the dark about the history of moves (but he can exploit the messages of a referee). Thus, computer playing of Kriegspiel is difficu...
متن کاملOverconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfectinformation game trees, and an imperfectinformation game tree search algorithm based on it. The formula and algorithm are general enough to incorporate a wide variety of opponent models. We analyze two opponent models. The “paranoid” model is an information-set analog of the minimax rule used in perfect-information games. The...
متن کاملTowards a Fast Detection of Opponents in Repeated Stochastic Games
Multi-agent algorithms aim to find the best response in strategic interactions. While many state-of-the-art algorithms assume repeated interaction with a fixed set of opponents (or even self-play), a learner in the real world is more likely to encounter the same strategic situation with changing counter-parties. This article presents a formal model of such sequential interactions, and a corresp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007